Two new classes of n-exangulated categories

نویسندگان

چکیده

Herschend-Liu-Nakaoka introduced the notion of n -exangulated categories. It is not only a higher dimensional analogue extriangulated categories defined by Nakaoka-Palu, but also gives simultaneous generalization -exact and ( + 2 ) -angulated Let C be an category X full subcategory . If satisfies ? P ? I , then we give necessary sufficient condition for ideal quotient / to category, where (resp. projective injective) objects in In addition, define -proper class ? prove that admits new structure. These two ways which are neither nor general.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probability of having $n^{th}$-roots and n-centrality of two classes of groups

In this paper, we consider the finitely 2-generated groups $K(s,l)$ and $G_m$ as follows:$$K(s,l)=langle a,b|ab^s=b^la, ba^s=a^lbrangle,\G_m=langle a,b|a^m=b^m=1, {[a,b]}^a=[a,b], {[a,b]}^b=[a,b]rangle$$ and find the explicit formulas for the probability of having nth-roots for them. Also, we investigate integers n for which, these groups are n-central.

متن کامل

N-GLUCOSIDES: NEW PHASE-II METABOLITES OF TWO BARBITURATES

The new phase-II N-glucoside metabolites of butobarbitone and pentobarbitone are identified and quantified in human urine after single doses of these drugs. The identification and quantification of these metabolites were carried out by mass spectroscopy technique (accurate mass measurement and high voltage scanning). It was found that the butobarbitone N-glucoside comprised 26% of the dos...

متن کامل

probability of having n^th-roots and n-centrality of two classes of groups

in this paper, we consider the finitely 2-generated groups k(s,l) and g_m as follows:k(s,l) = ;g_m = and find the explicit formulas for the probability of having nth-roots for them. also weinvestigate integers n for which, these groups are n-central.

متن کامل

N Semantic Classes are Harder than Two

We show that we can automatically classify semantically related phrases into 10 classes. Classification robustness is improved by training with multiple sources of evidence, including within-document cooccurrence, HTML markup, syntactic relationships in sentences, substitutability in query logs, and string similarity. Our work provides a benchmark for automatic n-way classification into WordNet...

متن کامل

Kaplansky Classes and Derived Categories

We put a monoidal model category structure on the category of chain complexes of quasi-coherent sheaves over a quasi-compact and semiseparated scheme X. The approach generalizes and simplifies the method used by the author in [Gil04] and [Gil06] to build monoidal model structures on the category of chain complexes of modules over a ring and chain complexes of sheaves over a ringed space. Indeed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2021

ISSN: ['1090-266X', '0021-8693']

DOI: https://doi.org/10.1016/j.jalgebra.2020.09.041